Euler totient function


Euler totient function

English-Russian cryptological dictionary . 2014.

Смотреть что такое "Euler totient function" в других словарях:

  • Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal …   Wikipedia

  • Euler's totient function — noun A function that counts how many integers below a given integer are coprime to it …   Wiktionary

  • Carmichael's totient function conjecture — In mathematics, Carmichael s totient function conjecture concerns the multiplicity of values of Euler s totient function phi;( n ), which counts the number of integers less than and coprime to n .This function phi;( n ) is equal to 2 when n is… …   Wikipedia

  • Proofs involving the totient function — This page provides proofs for identities involving the totient function varphi(k) and the Möbius function mu(k).um of integers relatively prime to and less than or equal to n Claim::sum {1le kle n atop {gcd(k,n)=1 k = frac{1}{2} , varphi(n) ,… …   Wikipedia

  • Jordan's totient function — In number theory, Jordan s totient function J k(n) of a positive integer n is the number of k tuples of positive integers all less than or equal to n that form a coprime ( k + 1) tuple together with n . This is a generalisation of Euler s totient …   Wikipedia

  • Euler–Mascheroni constant — Euler s constant redirects here. For the base of the natural logarithm, e ≈ 2.718..., see e (mathematical constant). The area of the blue region is equal to the Euler–Mascheroni constant. List of numbers – Irrational and suspected irrational… …   Wikipedia

  • Euler's theorem — In number theory, Euler s theorem (also known as the Fermat Euler theorem or Euler s totient theorem) states that if n is a positive integer and a is coprime to n , then:a^{varphi (n)} equiv 1 pmod{n}where φ( n ) is Euler s totient function and …   Wikipedia

  • Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… …   Wikipedia

  • List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… …   Wikipedia

  • Divisor function — σ0(n) up to n = 250 Sigma function σ …   Wikipedia

  • Leonhard Euler — Infobox Scientist name = Leonhard Euler|box width = 300px |200px image width = 200px caption = Portrait by Johann Georg Brucker birth date = birth date|df=yes|1707|4|15 birth place = Basel, Switzerland death date = 18 September (O.S 7 September)… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.